RELATIONS BETWEEN STOCHASTIC ORDERINGS AND GENERALIZED STOCHASTIC PRECEDENCE
نویسندگان
چکیده
منابع مشابه
Some New Results on Stochastic Orderings between Generalized Order Statistics
In this paper we specify the conditions on the parameters of pairs of gOS’s under which the corresponding generalized order statistics are ordered according to usual stochastic ordering, hazard rate ordering, likelihood ratio ordering and dispersive ordering. We consider this problem in one-sample as well as two-sample problems. We show that some of the results obtained by Franco et al. ...
متن کاملKarlin’s Basic Composition Theorems and Stochastic Orderings
Suppose λ,x,ζ traverse the ordered sets Λ, X and Z, respectively and consider the functions f(λ,x,ζ) and g(λ,ζ) satisfying the following conditions, (a) f(λ,x,ζ) > 0 and f is TP2 in each pairs of variables when the third variable is held fixed and (b) g(λ,ζ) is TP2. Then the function h(λ,x) =∫Z f(λ,x,ζ)g(λ,ζ)dµ(ζ), defined on Λ×X is TP2 in (λ,x). The aim of this note is to use a new stochast...
متن کاملNegative dependence and stochastic orderings
We explore negative dependence and stochastic orderings, showing that if an integer-valued random variable W satisfies a certain negative dependence assumption, then W is smaller (in the convex sense) than a Poisson variable of equal mean. Such W include those which may be written as a sum of totally negatively dependent indicators. This is generalised to other stochastic orderings. Application...
متن کاملConvex orderings for stochastic processes ∗
We consider partial orderings for stochastic processes induced by expectations of convex or increasing convex (concave or increasing concave) functionals. We prove that these orderings are implied by the analogous finite dimensional orderings.
متن کاملStochastic Machine Scheduling with Precedence Constraints
We consider parallel, identical machine scheduling problems where the jobs are subject to precedence constraints, release dates, and the processing times of jobs are governed by independent probability distributions. The objective is to minimize the expected value of the total weighted completion time ∑w j C j , where w j 0. Building upon a linear programming relaxation by Möhring, Schulz, and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Probability in the Engineering and Informational Sciences
سال: 2015
ISSN: 0269-9648,1469-8951
DOI: 10.1017/s0269964815000029